Concerning the problem of traditional Particle Swarm Optimization (PSO) such as slow convergence and being easy falling into local extremum, a Dynamic self-Adaptive Chaotic Quantum-behaved PSO (DACQPSO) was proposed by studying the relationship between population diversity and the evolution of PSO. The population-distribution-entropy was introduced into the evolutionary control of the particle swarm in this algorithm. Based on the Sigmoid function model, the method of calculating the contraction-expansion coefficient of the Quantum-behaved PSO (QPSO) was given. The average-distance-amongst-points was taken as the criterion of chaotic search to carry out a chaotic perturbation. The DACQPSO algorithm was applied to the coverage optimization of Wireless Sensor Network (WSN), and the simulation analysis was carried out. Experimental results show that compared with Standard PSO (SPSO), QPSO and Chaotic Quantum-behaved PSO (CQPSO), the DACQPSO algorithm improves the coverage rate by 3.3501%, 2.6502% and 1.9000% respectively. DACQPSO algorithm improves the coverage performance of WSN, and has better coverage optimization effect than other algorithms.

Traffic stream data has characteristics of multi-source, high speed and large volume, etc. When dealing with these data, the traditional methods and systems of data storage have exposed the problems of weak scalability and low real-time storage. To address these problems, this work designed and implemented a HBase-based real-time storage system for traffic streaming data. The system adopted the distributed storage architecture, standardized data through front-end preprocessing, divided different kinds of streaming data into different queues by using multi-source cache structure, and combined the consistent Hash algorithm, multi-thread and row-key optimization strategy to write data into HBase cluster in parallel. The experimental results demonstrate that, compared with the real-time storage system based on Oracle, the storage performance of the system has 3-5 times increment. When compared with the original HBase, it has 2-3 times increment of storage performance and it also has good scalability.